|
Ran Raz ((ヘブライ語:רָן רָז)) is a computer scientist who works in the area of computational complexity theory. He is a professor in the faculty of mathematics and computer science at the Weizmann Institute. Ran Raz is well known for his work on interactive proof systems. His two most-cited papers are on multi-prover interactive proofs and on probabilistically checkable proofs.〔Citations counts for as of 21 Feb 2009: Google Scholar: (313 ), ISI Web of Knowledge: 120, ACM Digital Library: (57 ) + (17 ), MathSciNet: (53 ). Citations counts for as of 21 Feb 2009: Google Scholar: (314 ), ACM Digital Library: (71 ), MathSciNet: (59 ).〕 Ran Raz received Erdős Prize in 2002. His work has been awarded in the top conferences in theoretical computer science. In 2004, he received the best paper award in ACM Symposium on Theory of Computing (STOC) for ,〔Proc. STOC 2004: "STOC 2004 Conference Awards", page x. (). One of two award papers.〕 and the best paper award in IEEE Conference on Computational Complexity (CCC) for .〔Proc. CCC 2004: "Awards", page x. ().〕 In 2008, the work received the best paper award in IEEE Symposium on Foundations of Computer Science (FOCS).〔Proc. FOCS 2008: "Foreword", page xii. ().〕 ==Selected publications== *. *. *. *. *. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Ran Raz」の詳細全文を読む スポンサード リンク
|